Contextual Coalitional Games
نویسندگان
چکیده
The study of cooperation among agents is of central interest in multiagent systems research. A popular way to model cooperation is through coalitional game theory. Much research in this area has had limited practical applicability as regards real-world multi-agent systems due to the fact that it assumes deterministic payoffs to coalitions and in addition does not apply to multi-agent environments that are stochastic in nature. In this paper, we propose a novel approach to modeling such scenarios where coalitional games will be contextualized through the use of logical expressions representing environmental and other state, and probability distributions will be placed on the space of contexts in order to model the stochastic nature of the scenarios. More formally, we present a formal representation language for representing contextualized coalitional games embedded in stochastic environments and we define and show how to compute expected Shapley values in such games in a computationally efficient manner. We present the value of the approach through an example involving robotics assistance in emergencies.
منابع مشابه
Core Membership Computation for Succinct Representations of Coalitional Games
In this paper, I compare and contrast two formal results on the computational complexity of core membership determination in two compact representations of coalitional games. Conitzer and Sandholm [1] proposed the multi-issue representations of coalitional games. This representation attempts to decompose a coalitional games into a set of sub-games. Later, Ieong and Shoham [3] proposed the margi...
متن کاملCoalitional Game Theory for Communication Networks: A Tutorial
Game theoretical techniques have recently become prevalent in many engineering applications, notably in communications. With the emergence of cooperation as a new communication paradigm, and the need for self-organizing, decentralized, and autonomic networks, it has become imperative to seek suitable game theoretical tools that allow to analyze and study the behavior and interactions of the nod...
متن کاملAlgorithms for Coalitional Games
Coalitional games are studied extensively in economics and computer science. They have recently shown to be a useful formalism and are applicable to a wide range of domains from electronic commerce to trade and negotiation systems. Key topics in coalitional games include both deciding the stability of given coalitions and calculating representative or all stable coalitions. However, typically t...
متن کاملOn coalitional semivalues
In this paper we propose a characterization of the coalitional value for transferable utility games (Owen, 1977), and we define and study coalitional semivalues, which are generalizations of semivalues (Dubey, Neyman and Weber, 1981).
متن کاملPath coalitional games
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these games, a coalition of edges or vertices is successful if it can enable an s-t path. We present polynomial-time algorithms to compute and verify least core payoffs of cost-based generalizations of path coalitional game...
متن کامل